CODE 98. Search Insert Position

版权声明：本文为博主原创文章，转载请注明出处，谢谢!

版权声明：本文为博主原创文章，转载请注明出处：http://blog.jerkybible.com/2013/10/30/2013-10-30-CODE 98 Search Insert Position/

访问原文「CODE 98. Search Insert Position」

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

public int searchInsert(int[] A, int target) {
	// IMPORTANT: Please reset any member data you declared, as
	// the same Solution instance will be reused for each test case.
	int start = 0;
	int end = A.length - 1;
	while (start < end) {
		int mid = (start + end) / 2;
		if (A[mid] < target) {
			start = mid + 1;
		} else if (A[mid] > target) {
			end = mid;
		} else {
			return mid;
		}
	}
	if (A[start] >= target) {
		return start;
	} else {
		return start + 1;
	}
}